A Polyhedral Frobenius Theorem with Applications to Integer Optimization

We prove a representation theorem of projections of sets of integer points by an integer matrix W . Our result can be seen as a polyhedral analogue of several classical and recent results related to the Frobenius problem. Our result is motivated by a large class of non-linear integer optimization problems in variable dimension. Concretely, we aim to optimize f(Wx) over a set F = P ∩ Z, where f is a non-linear function, P ⊂ R is a polyhedron and W ∈ Z. As a consequence of our representation theorem, we obtain a general efficient transformation from the latter class of problems to integer linear programming. Our bounds depends polynomially on various important parameters of the input data leading, among others, to first polynomial time algorithms for several classes of non-linear optimization problems.